Switch Codes: Codes for Fully Parallel Reconstruction

IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Switch Codes: Codes for Fully Parallel Reconstruction

Network switches and routers scale in rate by distributing the packet read/write operations across multiple memory banks. Rate scaling is achieved so long that sufficiently many packets can be written and read in parallel. However, due to the non-determinism of the read process, parallel pending read requests may contend on memory banks, and thus significantly lower the switching rate. In this ...

Fully Leakage-Resilient Codes

Leakage resilient codes (LRCs) are probabilistic encoding schemes that guarantee message hiding even under some bounded leakage on the codeword. We introduce the notion of fully leakage resilient codes (FLRCs), where the adversary can leak λ0 bits from the encoding process, namely, the message and the randomness involved during the encoding process. In addition the adversary can as usual leak f...

Hybrid Regenerating Codes for Distributed Storage Systems

Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...

Parallel Reed-Solomon Codes

The compound and integrated parallel Reed-Solomon (RS) codes for multichannel communication systems are suggested. The matrix model of errors for such codes is investigated. Methods of coding and decoding of parallel RS codes, and also methods of increase of their error correcting capability are developed.

Parallel error correcting codes